Stockpile scheduling with geometry constraints in dry bulk terminals
نویسندگان
چکیده
In this article we consider how to construct schedules for the stacking and reclaiming activities of high-throughput dry-bulk export terminals (DBET) that operate large machines called stacker-reclaimers (SR) handle iron ore, coking coal thermal export. with persistent stockpiles, ever-changing geometry stockpiles can impose challenging scheduling constraints. For those situations, propose each stockpile is modelled in detail, instance as a collection heterogeneous sized blocks. This bench block model (BBM). We then demonstrate are manipulated via their BBM be integrated form manager within sophisticated DBET engine. Numerical testing engine three horizontal (HBBM) has been performed indicates application worthwhile, if not essential. The concept generic, highly flexible, integrable into existing optimisation routines. results provided superior other approaches simple silos. provide devoid any errors contrast others which cannot, computational overheads do no greater than previous approaches. case studies considered, it was also pleasing see solutions comparable quality key performance criteria (KPI) equivalent constructed without consideration achievable. new approach significantly reduce time perform terminal planning increase utilization resources terminal.
منابع مشابه
Stockyard dimensioning for dry bulk terminals
1 Introduction ....................................................................................................... 1 2 Storage factor .................................................................................................... 2 3 Parameters which determine storage factor ................................................... 2 3.1 The interarrival time distribution ..................
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملAn Approximation Algorithm for Quay Crane Scheduling with Non- interference Constraints in Port Container Terminals
Nowadays competition between port container terminals, especially between geographically close ones, is rapidly increasing. How to improve the competitiveness of port container terminals is, therefore, an immediate challenge, with which port operators are confronted. In terms of port competitiveness, the makespan of a container vessel, which is the latest completion time among all handling task...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2021
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2021.105224